Is Quantum Bit Commitment Really Possible? Typeset Using Revt E X
نویسندگان
چکیده
We show that all proposed quantum bit commitment schemes are insecure because the sender can always cheat successfully by using an EPR-type of attack and delaying her measurement until she opens her commitment.
منابع مشابه
The Trouble with Quantum Bit Commitment Typeset Using Revt E X
In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Cr epeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common to all proposals of a certain kind, but the BCJL protocol does not fall in this category. Nevertheless...
متن کاملSchumacher's Quantum Data Compression as a Quantum Computation Typeset Using Revt E X 2
An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using O(n 3) two-and three-bit primitive reversible operati...
متن کاملQuantum Bit Commitment can be Unconditionally Secure
It is generally believed that unconditionally secure quantum bit commitment is ruled out in principle by a “no-go theorem”. We point out that the theorem only establishes the existence of a cheating unitary operator in any scheme of quantum bit commitment, however there is no proof that the unitary operator is always known to the cheating party, hence it does not necessarily follow that quantum...
متن کاملTwo-bit Gates Are Universal for Quantum Computation Typeset Using Revt E X 1
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are suucient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of the Tof-foli three-bit gate of classical reversible computing. Two-bit quantum gates may be implem...
متن کاملQuantum Bit Commitment Using Entangled States
Based on the fact that the entanglement can not be created locally, we proposed a quantum bit commitment protocol, in which entangled states and quantum algorithms is used. The bit is not encoded with the form of the quantum states, and delaying the measurement is required. Therefore the protocol will not be denied by the Mayers-Lo-Chau no-go theorem, and unconditional security is achieved. Typ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996